A Kruskal–Katona type theorem for graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Kruskal-Katona type theorem for graphs

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

متن کامل

A Ramsey-Type Theorem for Traceable Graphs*

A graph G is traceable if there is a path passing through all the vertices of G. It is proved that every infinite traceable graph either contains arbitrarily large ftnite chordless paths, or contains a subgraph isomorphic to graph A, illustrated in the text. A corollary is that every Jinitely generated infinite lattice of length 3 contains arbitrarily large jkite fences. It is also proved that ...

متن کامل

a cauchy-schwarz type inequality for fuzzy integrals

نامساوی کوشی-شوارتز در حالت کلاسیک در فضای اندازه فازی برقرار نمی باشد اما با اعمال شرط هایی در مسئله مانند یکنوا بودن توابع و قرار گرفتن در بازه صفر ویک می توان دو نوع نامساوی کوشی-شوارتز را در فضای اندازه فازی اثبات نمود.

15 صفحه اول

Bishop-Phelps type Theorem for Normed Cones

In this paper the notion of  support points of convex sets  in  normed cones is introduced and it is shown that in a  continuous normed cone, under the appropriate conditions, the set of support points of a  bounded Scott-closed convex set is nonempty. We also present a Bishop-Phelps type Theorem for normed cones.

متن کامل

A Brooks-type Theorem for the Bandwidth of Interval Graphs

Let G be an interval graph. The layout that arranges the intervals in order by right endpoint easily shows that the bandwidth of G is at most its maximum degree ∆. Hence, if G contains a clique of size ∆ + 1, then its bandwidth must be ∆. In this paper we prove a Brooks-type bound on the bandwidth of interval graphs. Namely, the bandwidth of an interval graph is at most ∆, with equality if and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2010

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2009.04.003